Improving Disk Sector Integrity Using K-Dimension Hashing
نویسندگان
چکیده
The integrity of data stored on a hard disk is typically verified by computing the chained hash value of disk sector data in a specific order. However, this technique fails when one or more sectors turn bad during storage, making it impossible to compute their hash values. This paper presents a k-dimension hashing scheme, which computes and stores multiple hash values for each hard disk sector. The hash values for each sector are computed in different ways; thus, when a hard disk develops bad sectors, it is still possible to verify the integrity of the data in the unaffected sectors. The paper also discusses how hashing parameters may be tuned to achieve desirable properties, including minimizing the probability that the integrity of a sector cannot be verified because other sectors have gone bad.
منابع مشابه
An Efficient Scheme for Hard Disk Integrity Check in Digital Forensics by Hashing with Combinatorial Group Testing
In this paper, we describe the problem of checking the integrity of a hard disk for forensics investigation after the computer of a suspect has been seized. Existing solutions do not provide a satisfactory solution to solve the problem. They either require a huge amount of storage to store the hash values of the sectors or may not be able to cope with the situation in an effective way in case s...
متن کاملThe EMD Mode of Operation (A Tweaked, Wide-Blocksize, Strong PRP)
We describe a block-cipher mode of operation, EMD, that builds a strong pseudorandom per-mutation (PRP) on nm bits (m ≥ 2) out of a strong PRP on n bits (i.e., a block cipher). Theconstructed PRP is also tweaked (in the sense of [10]): to determine the nm-bit ciphertext blockC =EK(P ) one provides, besides the key K and the nm-bit plaintext block P , an n-bit tweak T . The<l...
متن کاملLocality sensitive hashing: A comparison of hash function types and querying mechanisms
It is well known that high-dimensional nearest-neighbor retrieval is very expensive. Dramatic performance gains are obtained using approximate search schemes, such as the popular Locality-Sensitive Hashing (LSH). Several extensions have been proposed to address the limitations of this algorithm, in particular, by choosing more appropriate hash functions to better partition the vector space. All...
متن کاملUSING DISTINCT SECTORS IN MEDIA SAMPLING AND FULL MEDIA ANALYSIS TO DETECT PRESENCE OF DOCUMENTS FROM A CORPUS by
Forensics examiners frequently search for known content by comparing each file from a target media to a known file hash database. We propose using sector hashing to rapidly identify content of interest. Using this method, we hash 512 B or 4 KiB disk sectors of the target media and compare those to a hash database of known file blocks, fixed-sized file fragments of the same size. Sector-level an...
متن کاملComparing Search Algorithms Using Sorting and Hashing on Disk and in Memory
We compare sorting and hashing for implicit graph search using disk storage. We first describe efficient pipelined implementations of both algorithms, which reduce disk I/O. We then compare the two algorithms and find that hashing is faster, but that sorting requires less disk storage. We also compare disk-based with in-memory search, and surprisingly find that there is little or no time overhe...
متن کامل